Parallel Multiple-Symbol Variable-Length Decoding

نویسندگان

  • Jari Nikara
  • Stamatis Vassiliadis
  • Jarmo Takala
  • Mihai Sima
  • Petri Liuha
چکیده

In this paper, a parallel Variable-Length Decoding (VLD) scheme is introduced. The scheme is capable of decoding all the codewords in an N -bit buffer whose accumulated codelength is at most N . The proposed method partially breaks the recursive dependency related to the MPEG-2 VLD. All possible codewords in the buffer are detected in parallel and the sum of the codelengths is provided to the external shifter aligning the variable-length coded input stream for a new decoding cycle. Two length detection mechanisms are proposed: the first approach determines the length in a parallel/serial fashion and the second using a new device denoted as MultiplexedAdd. In order to prove feasibility and determine the limiting factors of our proposal, the parallel/serial codeword detector with 32bit input has been described in behavioral non-optimized VHDL and mapped onto Altera’s ACEX EP1K100 FPGA. The implemented prototype exhibits a latency of 110 ns and uses 32% of the logic cells of the device. When applied to MPEG-2 standard benchmark scenes, on average 3.5 symbols are decoded per cycle.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Design of a High Speed CAVLC Encoder and Decoder with Parallel Data Path

Variable length coding (VLC) is very suitable for regular data and efficient to compress data without any loss. VLC uses shorter bits of codewords instead of data occurring frequently, but uses the longer bits of codewords instead of data occurring infrequently. It is used in MPEG – 1/2/4 and H.26X (video and image compression standards). The entropy decoder in MPEG-4 AVC/H.264 baseline standar...

متن کامل

Joint Source and Channel Decoding for Variable Length Encoded Turbo Codes

Joint source and channel decoding (JSCD) has been proved to be an effective technique which can improve decoding performance by exploiting residual source redundancy. Most previous publications on this subject focus on a traditional coding scheme in which the source variable-length coding (VLC) is serially concatenated with a channel code. In this paper, a parallel concatenated coding scheme fo...

متن کامل

FPGA-Based Variable Length Decoders

A straightforward and fair comparison of variable length decoders is extremely difficult due to different implementation approaches, e.g., different codeword tables, IC technologies, design styles, and compression ratios. On the other hand, reconfigurable platforms provide fast design iteration times to change the design variables. Therefore, the variable rate symbol-parallel Variable Length De...

متن کامل

Iterative Source/Channel-Decoding Using Reversible Variable Length Codes

In this paper we describe a trellis representation of variable length coded data which is capable of being used for bit-level or symbol-level maximum a posteriori (MAP) decoding of variable length codes (VLC). A bit-level soft-input/soft-output module is derived and is applied in an iterative decoding structure consisting of an outer variable length code and an inner convolutional code. Due to ...

متن کامل

Symbol-by-Symbol MAP Decoding of Variable Length Codes

In this paper we introduce a new approach in the decoding of variable length codes. Based on the tree structure of these codes a trellis representation is derived which allows the application of the BCJR algorithm. This algorithm provides us with the a posteriori probabilities of the transmitted source symbols. Therefore we do not only use soft information from an outer decoding stage but also ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002